ar X iv : 0 70 8 . 09 05 v 1 [ cs . I T ] 7 A ug 2 00 7 Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes ∗
نویسندگان
چکیده
We introduce the notion of the stopping redundancy hierarchy of a linear block code as a measure of the tradeoff between performance and complexity of iterative decoding for the binary erasure channel. We derive lower and upper bounds for the stopping redundancy hierarchy via Lovász’s Local Lemma and Bonferroni-type inequalities, and specialize them for codes with cyclic parity-check matrices. Based on the observed properties of parity-check matrices with good stopping redundancy characteristics, we develop a novel decoding technique, termed automorphism group decoding, that combines iterative message passing and permutation decoding. We also present bounds on the smallest number of permutations of an automorphism group decoder needed to correct any set of erasures up to a prescribed size. Simulation results demonstrate that for a large number of algebraic codes, the performance of the new decoding method is close to that of maximum likelihood decoding.
منابع مشابه
ar X iv : 0 70 8 . 24 05 v 1 [ qu an t - ph ] 1 7 A ug 2 00 7 PT - symmetry and Integrability ∗
We briefly explain some simple arguments based on pseudo Hermiticity, supersymmetry and PT -symmetry which explain the reality of the spectrum of some non-Hermitian Hamiltonians. Subsequently we employ PT -symmetry as a guiding principle to construct deformations of some integrable systems, the Calogero-Moser-Sutherland model and the Korteweg deVries equation. Some properties of these models ar...
متن کاملar X iv : 1 30 7 . 17 46 v 1 [ cs . I T ] 6 J ul 2 01 3 Generalized Quasi - Cyclic Codes Over F q + u F q
Generalized quasi-cyclic (GQC) codes with arbitrary lengths over the ring Fq + uFq, where u 2 = 0, q = p, n a positive integer and p a prime number, are investigated. By the Chinese Remainder Theorem, structural properties and the decomposition of GQC codes are given. For 1-generator GQC codes, minimal generating sets and lower bounds on the minimum distance are given. As a special class of GQC...
متن کاملar X iv : 0 70 8 . 23 95 v 1 [ cs . C R ] 1 7 A ug 2 00 7 Key Agreement and Authentication Schemes Using Non - Commutative Semigroups
We give a new two-pass authentication scheme, which is a generalisation of an authentication scheme of Sibert-Dehornoy-Girault based on the Diffie-Hellman conjugacy problem. Compared to the above scheme, for some parameters it is more efficient with respect to multiplications. We sketch a proof that our authentication scheme is secure.
متن کاملOn Skew Cyclic Codes over a Finite Ring
In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007